Generating Trace Checkers for Test Oracles
نویسندگان
چکیده
A generic tableau algorithm, which is the basis for a general customizable method for producing test oracles from temporal logic speciications, is described in 8]. The algorithm accepts semantic rules as parameters for building the semantic tableau for a speciication. Parameterizing the tableau algorithm by semantic rules permits it to easily accommodate a variety of temporal operators and provides a clean mechanism for ne-tuning the algorithm to produce eecient oracles. In this paper, we report on our prototype implementation of the algorithm and on our experience with its use.
منابع مشابه
Eecient Speciication-based Oracles for Critical Systems
EEective testing of critical systems has been hampered by the lack of a cost-eeective method for deciding the correctness of a program's behavior under test. Using formal speciications to describe the critical system properties and then checking test results against these spe-ciications overcomes these problems. If these test oracles , which are mechanisms for determining whether a test passes ...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملAutomatic Testing of Object-Oriented Software
Effective testing involves preparing test oracles and test cases, two activities which are too tedious to be effectively performed by humans, yet for the most part remain manual. The AutoTest unit testing framework automates both, by using Eiffel contracts — already present in the software — as test oracles, and generating objects and routine arguments to exercise all given classes; manual test...
متن کاملIdentifying an Honest ${\rm EXP}^{\rm NP}$ Oracle Among Many
We provide a general framework to remove short advice by formulating the following computational task for a function f : given two oracles at least one of which is honest (i.e. correctly computes f on all inputs) as well as an input, the task is to compute f on the input with the help of the oracles by a probabilistic polynomial-time machine, which we shall call a selector. We characterize the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007